Computing runs on a general alphabet
نویسندگان
چکیده
منابع مشابه
Computing Runs on a General Alphabet
We describe a RAM algorithm computing all runs (=maximal repetitions) of a given string of length n over a general ordered alphabet in O(n log 2 3 n) time and linear space. Our algorithm outperforms all known solutions working in Θ(n log σ) time provided σ = n, where σ is the number of distinct letters in the input string. We conjecture that there exists a linear time RAM algorithm finding all ...
متن کاملNear-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE queries have been known for over a decade. However, these algorithms assume a linearly-sortable integer alphabet. A recent breakthrough paper by Bannai et. al. (SODA 2015) showed a link between the two notions: all the r...
متن کاملCrochemore's Repetitions Algorithm Revisited - Computing Runs
Crochemore’s repetitions algorithm introduced in 1981 was the first O(n logn) algorithm for computing repetitions. Since then, several linear-time worst-case algorithms for computing runs have been introduced. They all follow a similar strategy: first compute the suffix tree or array, then use the suffix tree or array to compute the Lempel-Ziv factorization, then using the Lempel-Ziv factorizat...
متن کاملComputing Abelian Covers and Abelian Runs
Two strings u and v are said to be Abelian equivalent if u is a permutation of the characters of v. We introduce two new regularities on strings w.r.t. Abelian equivalence, called Abelian covers and Abelian runs, which are generalizations of covers and runs of strings, respectively. We show how to determine in O(n) time whether or not a given string w of length n has an Abelian cover. Also, we ...
متن کاملUniversal channel coding for general output alphabet
We propose a universal channel coding when each output distribution forms an exponential family even in a continuous output system. We propose two types of universal codes; One has the exponentially decreasing error with explicit a lower bound for the error exponent. The other attains the ǫ-capacity up to the second order. Our encoder is the same as the previous paper [CMP 289, 1087]. For our d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2016
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2015.11.016